Path Planning for Autonomous Vehicles in Unknown Dynamic Environment Based on Deep Reinforcement Learning

نویسندگان

چکیده

Autonomous vehicles can reduce labor power during cargo transportation, and then improve transportation efficiency, for example, the automated guided vehicle (AGV) in warehouse operation efficiency. To overcome limitations of traditional path planning algorithms unknown environments, such as reliance on high-precision maps, lack generalization ability, obstacle avoidance capability, this study focuses investigating Deep Q-Network its derivative algorithm to enhance network structures. A new named APF-D3QNPER is proposed, which combines action output method artificial potential field (APF) with Dueling Double Q Network algorithm, experience sample rewards are considered playback portion Reinforcement Learning (DRL) enhances convergence ability DRL algorithm. long short-term memory (LSTM) added state feature extraction part adaptability environments spatiotemporal sensitivity environment. The compared mainstream deep reinforcement learning using a robot operating system Gazebo simulation platform by conducting experiments. results demonstrate that exhibits excellent abilities environment, speed, loss value, time, length all less than other diverse scenarios.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments

We describe a practical path-planning algorithm for an autonomous vehicle operating in an unknown semi-structured (or unstructured) environment, where obstacles are detected online by the robot’s sensors. This work was motivated by and experimentally validated in the 2007 DARPA Urban Challenge, where robotic vehicles had to autonomously navigate parking lots. The core of our approach to path pl...

متن کامل

Path planning for autonomous vehicles

In this study, we first address the problem of visibility-based target tracking for a team of mobile observers trying to track a team of mobile targets. Initially, we introduce the notion of pursuit fields for a single observer to track a single target around a corner based on the previous work. Pursuit fields are used to generate navigation strategies for a single observer. In order to account...

متن کامل

Path Planning for Autonomous Vehicles

Central problems in path planning are obstacle avoidance and path optimisation. The aim of our work was to investigate the efciency of an Evolution Strategy for optimising robot parameters in both respects. We chose a simple model in order to highlight the effect of evolution as an optimisation procedure. In our model the robot has to reach given goals from a given starting position. In our sim...

متن کامل

Path Planning based on Bézier Curve for Autonomous Ground Vehicles

In this paper we present two path planning algorithms based on Bézier curves for autonomous vehicles with waypoints and corridor constraints. Bézier curves have useful properties for the path generation problem. The paper describes how the algorithms apply these properties to generate the reference trajectory for vehicles to satisfy the path constraints. Both algorithms join cubic Bézier curve ...

متن کامل

Cooperative Path-planning for Autonomous Vehicles Using Dynamic Programming

It is shown how to model a cooperative path planning system for multiple autonomous air vehicles within the framework of a stochastic (dynamic programming) decision process. The proposed approach allows the vehicles to cooperate and find near-optimal search paths over a given environment in the presence of uncertainty and constraints on movement and computational power.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app131810056